Model Checking for Multi - Valued CTL
نویسندگان
چکیده
A multi-valued version of CTL (mv-CTL), where both the propositions and the accessibility relation are multi-valued taking values in a nite quasi-Boolean algebra, is deened. A translation from mv-CTL model checking to CTL model checking is investigated. First, the case where the elements of quasi-Boolean algebras are totally ordered is considered. Secondly, it is shown how to design a translation algorithm for the two most commonly applied quasi-Boolean algebras. This construction suggests the way one can deal with more complex quasi-Boolean algebras if necessary.
منابع مشابه
Reducing Model Checking from Multi-valued Ctl to Ctl
A multi-valued version of CTL (mv-CTL), where both the propositions and the accessibility relation are multi-valued taking values in a nite quasi-boolean algebra, is considered. A general translation from mv-CTL to CTL model checking is deened. An application of the translation is shown for the most commonly used quasi-boolean algebras.
متن کاملOn Designated Values in Multi-valued CTL* Model Checking
A multi-valued version of CTL∗ (mv-CTL∗), where both the propositions and the accessibility relation are multi-valued, taking values in a complete lattice with a complement, is considered. Contrary to all the existing model checking results for multi-valued modal logics, our lattices are not required to be finite. A set of restrictions is provided under which there is a direct translation from ...
متن کاملAn Introduction to Multi-Valued Model Checking
Nowadays computer systems have become ubiquitous. Most of the resources in the development of such systems, and especially in the fail-safe ones, are allocated into the simulation and verification of their behavior. One such automated method of verification is model checking. Given a mathematical description of the real system and a specification usually in the form of temporal logics, a model ...
متن کاملCTL Model-Checking over Logics with Non-Classical Negations
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois and minimal negations, calling the resulting language CTL. We define CTL operators and show that they can be computed using fixpoints. We further discuss how to extend our existing multi-valued model-checker Chek [8] to re...
متن کاملModel-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when information is gathered from multiple sources). In this paper we propose the use of quasi-boolean multi-valued logics for reasoning about such systems. We also give semantics to a multi-valued extension of CTL, descr...
متن کامل